Recognizing triangulated Cartesian graph products
نویسندگان
چکیده
منابع مشابه
Recognizing Cartesian graph bundles
Graph bundles generalize the notion of covering graphs and graph products. In this paper we extend some of the methods for recognizing Cartesian product graphs to graph bundles. Two main notions are used. The first one is the well-known equivalence relation δ defined on the edge-set of a graph. The second one is the concept of k-convex subgraphs. A subgraph H is k-convex in G, if for any two ve...
متن کاملRecognizing Cartesian products in linear time
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammeer, Hagauer, and Imrich [2], who compute the prime factors in O(m log n) time, where m denotes the number of vertices of G and n the number of edges. Our algorithm is conceptually simpler. It gains its efficiency by the...
متن کاملRecognizing weighted directed cartesian graph bundles
In this paper we show that methods for recognizing Cartesian graph bundles can be generalized to weighted digraphs. The main result is an algorithm which lists the sets of degenerate arcs for all representations of digraph as a weighted directed Cartesian graph bundle over simple base digraphs not containing transitive tournament on three vertices. Two main notions are used. The first one is th...
متن کاملRadio Labeling Cartesian Graph Products
Radio labeling is derived from the assignment of radio frequencies (channels) to a set of transmitters. The frequencies assigned depend on the geographical distance between the transmitters: the closer two transmitters are, the greater the potential for interference between their signals. Thus when the distance between two transmitters is small, the difference in the frequencies assigned must b...
متن کاملAlgorithm for Recognizing Cartesian Graph Bundles
Graph bundles generalize the notion of covering graphs and graph products. In [8], authors constructed an algorithm that ÿnds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base. In [21], the unique square property is deÿned and it is shown that any equivalence relation possessing the unique square property determi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.08.001